Constraint Satisfaction via Partially Parallel Propagation Steps 1
نویسنده
چکیده
The constraint satisfaction problem (CSP) deals with the assignment of values to variables according to existing constraints. Given n variables with their nite domains, the admissible combinations of values form a set of n-tuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction. 0 Introduction The constraint satisfaction problem (CSP) deals with the assignment of values to variables according to existing constraints. Given n variables with their nite domains, the admissible combinations of values form a set of n-tuples which represents the globally consistent solution.
منابع مشابه
Chaotic iteration for polynomial constraints
In this paper we argue for an alternative way of designing solvers based on interval arithmetic. We achieve constraint propagation over real numbers using chaotic iteration, a general and basic technique used for computing limits of iterations of nite sets of functions. This is carried out in two steps: rst involving computationally \cheap" functions for reducing constraint satisfaction problem...
متن کاملOn the Parallel Complexity of Some Constraint Satisfaction Problems
Constraint satisfaction networks have been shown to be a very useful tool for knowledge representation in Artificial Intelligence applications. These networks often utilize local constraint propagation techniques to achieve global consistency (consistent labelling in vision). Such methods have been used extensively in the context of image understanding and interpretation, as well as planning, n...
متن کاملOn the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms
We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models. This method is developed in the particular case of partially decimated random constraint satisfaction problems. This allows to develop a theoretical understanding of a class of algorit...
متن کاملThe Propagation Depth of Local Consistency
We establish optimal bounds on the number of nested propagation steps in k-consistency tests. It is known that local consistency algorithms such as arc-, pathand k-consistency are not efficiently parallelizable. Their inherent sequential nature is caused by long chains of nested propagation steps, which cannot be executed in parallel. This motivates the question “What is the minimum number of n...
متن کاملParallel Execution Models for Constraint Propagation
Constraint propagation algorithms present inherent parallelism. Each constraint behaves as a concurrent process triggered by changes in the store of variables, updating the store in its turn. There is an inherent sequentiality, as well, since a constraint must be executed only as the consequence of a previous execution of another constraint. We have developed di erent parallel execution models ...
متن کامل